By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 20, Issue 2, pp. 273-543

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs

Daniela Kühn and Deryk Osthus

pp. 273-286

BibTeX  Abstract Full Text:  PDF

On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out

Hong-Bin Chen and Frank K. Hwang

pp. 287-290

BibTeX  Abstract Full Text:  PDF

A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings

Tomás Feder

pp. 291-301

BibTeX  Abstract Full Text:  PDF

Real Number Graph Labellings with Distance Conditions

Jerrold R. Griggs and Xiaohua Teresa Jin

pp. 302-327

BibTeX  Abstract Full Text:  PDF

A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment

Paul W. Goldberg

pp. 328-343

BibTeX  Abstract Full Text:  PDF

The Minor Crossing Number

Drago Bokal, Gasper Fijavz, and Bojan Mohar

pp. 344-356

BibTeX  Abstract Full Text:  PDF

The Bidimensional Theory of Bounded-Genus Graphs

Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos

pp. 357-371

BibTeX  Abstract Full Text:  PDF

Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection

Tomás Feder and Daniel Ford

pp. 372-394

BibTeX  Abstract Full Text:  PDF

The Volume of the Giant Component of a Random Graph with Given Expected Degrees

Fan Chung and Linyuan Lu

pp. 395-411

BibTeX  Abstract Full Text:  PDF

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons

Prosenjit Bose, Luc Devroye, William Evans, and David Kirkpatrick

pp. 412-427

BibTeX  Abstract Full Text:  PDF

Full Color Theorems for L(2,1)-Colorings

Peter C. Fishburn and Fred S. Roberts

pp. 428-443

BibTeX  Abstract Full Text:  PDF

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

Hristo N. Djidjev

pp. 444-462

BibTeX  Abstract Full Text:  PDF

Sparse Sourcewise and Pairwise Distance Preservers

Don Coppersmith and Michael Elkin

pp. 463-501

BibTeX  Abstract Full Text:  PDF

On the Greedy Superstring Conjecture

Maik Weinard and Georg Schnitger

pp. 502-522

BibTeX  Abstract Full Text:  PDF

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable

Shlomo Hoory and Stefan Szeider

pp. 523-528

BibTeX  Abstract Full Text:  PDF

On Graph Associations

Landon Rabern

pp. 529-535

BibTeX  Abstract Full Text:  PDF

Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings

Daniel Král', Riste Skrekovski, and Martin Tancer

pp. 536-543

BibTeX  Abstract Full Text:  PDF